Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems

Atomic registers are certainly the most basic objects of computing science. Their implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper presents an algorithm which implements a single-writer multi-reader atomic register with four message types only, and where no message needs to carry control information in addition to its type. Hence, two bits are sufficient to capture all the control information carried by all the implementation messages. Moreover, the messages of two types need to carry a data value while the messages of the two other types carry no value at all. As far as we know, this algorithm is the first with such an optimality property on the size of control information carried by messages. It is also particularly efficient from a time complexity point of view

Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems

The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficiency is measured according to two different underlying synchrony assumptions. Whatever this assumption, a write operation always costs a round-trip delay, while a read operation costs always a round-trip delay in favorable circumstances (intuitively, when it is not concurrent with a write). When designing this algorithm, the design spirit was to be as close as possible to the one of the famous ABD algorithm (proposed by Attiya, Bar-Noy, and Dolev)

Commutator Relations Reveal Solvable Structures in Unambiguous State Discrimination

We present a criterion, based on three commutator relations, that allows to decide whether two self-adjoint matrices with non-overlapping support are simultaneously unitarily similar to quasidiagonal matrices, i.e., whether they can be simultaneously brought into a diagonal structure with 2x2-dimensional blocks. Application of this criterion to unambiguous state discrimination provides a systematic test whether the given problem is reducible to a solvable structure. As an example, we discuss unambiguous state comparison.Comment: 5 pages, discussion of related work adde

Relation between Light Cone Distribution Amplitudes and Shape Function in B mesons

The Bakamjian-Thomas relativistic quark model provides a Poincar\'e representation of bound states with a fixed number of constituents and, in the heavy quark limit, form factors of currents satisfy covariance and Isgur-Wise scaling. We compute the Light Cone Distribution Amplitudes of $B$ mesons $\phi_{\pm}^B(\omega)$ as well as the Shape Function $S(\omega)$, that enters in the decay $B \to X_s \gamma$, that are also covariant in this class of models. The LCDA and the SF are related through the quark model wave function. The former satisfy, in the limit of vanishing constituent light quark mass, the integral relation given by QCD in the valence sector of Fock space. Using a gaussian wave function, the obtained $S(\omega)$ is identical to the so-called Roman Shape Function. From the parameters for the latter that fit the $B \to X_s\gamma$ spectrum we predict the behaviour of $\phi_{\pm}^B(\omega)$. We discuss the important role played by the constituent light quark mass. In particular, although $\phi_-^B(0) \not= 0$ for vanishing light quark mass, a non-vanishing mass implies the unfamiliar result $\phi_-^B (0) = 0$. Moreover, we incorporate the short distance behaviour of QCD to $\phi_+^B (\omega)$, which has sizeable effects at large $\omega$. We obtain the values for the parameters $\bar{\Lambda} \cong 0.35$ GeV and $\lambda_B^{-1} \cong 1.43$ GeV$^{-1}$. We compare with other theoretical approaches and illustrate the great variety of models found in the literature for the functions $\phi_{\pm}^B (\omega)$; hence the necessity of imposing further constraints as in the present paper. We briefly review also the different phenomena that are sensitive to the LCDA.Comment: 6 figure

On Verifying Causal Consistency

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of verifying automatically whether the executions of an implementation of a data structure are causally consistent. We consider two problems: (1) checking whether one single execution is causally consistent, which is relevant for developing testing and bug finding algorithms, and (2) verifying whether all the executions of an implementation are causally consistent. We show that the first problem is NP-complete. This holds even for the read-write memory abstraction, which is a building block of many modern distributed systems. Indeed, such systems often store data in key-value stores, which are instances of the read-write memory abstraction. Moreover, we prove that, surprisingly, the second problem is undecidable, and again this holds even for the read-write memory abstraction. However, we show that for the read-write memory abstraction, these negative results can be circumvented if the implementations are data independent, i.e., their behaviors do not depend on the data values that are written or read at each moment, which is a realistic assumption.Comment: extended version of POPL 201

Neutron transition strengths of 21+2^+_1 states in the neutron rich Oxygen isotopes determined from inelastic proton scattering

A coupled-channel analysis of the $^{18,20,22}$O$(p,p')$ data has been performed to determine the neutron transition strengths of 2$^+_1$ states in Oxygen targets, using the microscopic optical potential and inelastic form factor calculated in the folding model. A complex density- and \emph{isospin} dependent version of the CDM3Y6 interaction was constructed, based on the Brueckner-Hatree-Fock calculation of nuclear matter, for the folding model input. Given an accurate isovector density dependence of the CDM3Y6 interaction, the isoscalar ($\delta_0$) and isovector ($\delta_1$) deformation lengths of 2$^+_1$ states in $^{18,20,22}$O have been extracted from the folding model analysis of the $(p,p')$ data. A specific $N$-dependence of $\delta_0$ and $\delta_1$ has been established which can be linked to the neutron shell closure occurring at $N$ approaching 16. The strongest isovector deformation was found for 2$^+_1$ state in $^{20}$O, with $\delta_1$ about 2.5 times larger than $\delta_0$, which indicates a strong core polarization by the valence neutrons in $^{20}$O. The ratios of the neutron/proton transition matrix elements ($M_n/M_p$) determined for 2$^+_1$ states in $^{18,20}$O have been compared to those deduced from the mirror symmetry, using the measured $B(E2)$ values of 2$^+_1$ states in the proton rich $^{18}$Ne and $^{20}$Mg nuclei, to discuss the isospin impurity in the $2^+_1$ excitation of the $A=18,T=1$ and $A=20,T=2$ isobars.Comment: Version accepted for publication in Physical Review

The eventual clusterer oracle and its application to consensus in MANETs

2007-2008 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

The eventual leadership in dynamic mobile networking environments

2007-2008 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe